Asymptotic iteration method for eigenvalue problems
نویسندگان
چکیده
An asymptotic interation method for solving second-order homogeneous linear differential equations of the form y = λ0(x)y ′ + s0(x)y is introduced, where λ0(x) 6= 0 and s0(x) are C∞ functions. Applications to Schrödinger type problems, including some with highly singular potentials, are presented. PACS 03.65.Ge Asymptotic iteration method for eigenvalue problems page 2
منابع مشابه
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملOn the residual inverse iteration for nonlinear eigenvalue problems admitting a Rayleigh functional
The residual inverse iteration is a simple method for solving eigenvalue problems that are nonlinear in the eigenvalue parameter. In this paper, we establish a new expression and a simple bound for the asymptotic convergence factor of this iteration in the special case that the nonlinear eigenvalue problem is Hermitian and admits a so called Rayleigh functional. These results are then applied t...
متن کاملConstruction of exact solutions to eigenvalue problems by the asymptotic iteration method
We apply the asymptotic iteration method (AIM) [J. Phys. A: Math. Gen. 36, 11807 (2003)] to solve new classes of second-order homogeneous linear differential equation. In particular, solutions are found for a general class of eigenvalue problems which includes Schrödinger problems with Coulomb, harmonic oscillator, or Pöschl-Teller potentials, as well as the special eigenproblems studied recent...
متن کاملConjugate Gradient Methods for Solving the Smallest Eigenpair of Large Symmetric Eigenvalue Problems
In this paper, a detailed description of CG for evaluating eigenvalue problems by minimizing the Rayleigh quotient is presented from both theoretical and computational viewpoints. Three variants of CG together with their asymptotic behaviours and restarted schemes are discussed. In addition, it is shown that with a generally selected preconditioning matrix the actual performance of the PCG sche...
متن کاملAnalyzing the convergence factor of residual inverse iteration
A complete characterization of the convergence factor can be very useful when analyzing the asymptotic convergence of an iterative method. We will here establish a formula for the convergence factor of the method called residual inverse iteration, which is a method for nonlinear eigenvalue problems and a generalization of the well known inverse iteration. The formula for the convergence factor ...
متن کامل